A new Multi-Party Private Set Intersection Protocol based on OPRFs

نویسندگان

چکیده

In many crucial real-world applications, parties must jointly perform some secure multi-party computation (MPC) while keeping their inputs hidden from other parties. Private Set Intersection (PSI), the specific area of Multi-Party Computation, let learn intersection private data sets without sharing secret with others. For instance, a smartphone user downloads messaging application, naturally, he wants to discover who are contacts that using same application. The naive and insecure solution is send all server them. However, does not want share his application for privacy issues. To handle this, in recent years, companies organizations start use PSI enhance security little cost communication computation. this paper, we introduce novel method compute multi where there at least three or more participating protocol. By employing Zero-Secret Sharing scheme Oblivious Pseudo-Random Functions (OPRFs), securely calculate computational complexities which both linear number

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scalable Multi-party Private Set-Intersection

In this work we study the problem of private set-intersection in the multi-party setting and design two protocols with the following improvements compared to prior work. First, our protocols are designed in the so-called star network topology, where a designated party communicates with everyone else, and take a new approach of leveraging the 2PC protocol of [FNP04]. This approach minimizes the ...

متن کامل

Private Two-Party Set Intersection Protocol in Rational Model

Many data mining algorithms use privacy preserving set intersection operations. Private set operations have considered semi-honest and malicious adversarial models in cryptographic settings. Protocols in semi-honest model, requiring light computations, provide weak security. Protocols in malicious model guarantee strong security at the price of expensive computations like homomorphic encryption...

متن کامل

An Unconditionally Secure Protocol for Multi-Party Set Intersection

Existing protocols for private set intersection are based on homomorphic public-key encryption and the technique of representing sets as polynomials in the cryptographic model. Based on the ideas of these protocols and the two-dimensional verifiable secret sharing scheme, we propose a protocol for private set intersection in the informationtheoretic model. By representing the sets as polynomial...

متن کامل

Multi Party Distributed Private Matching, Set Disjointness and Cardinality Set Intersection with Information Theoretic Security

In this paper, we focus on the specific problems of Private Matching, Set Disjointness and Cardinality Set Intersection in information theoretic settings. Specifically, we give perfectly secure protocols for the above problems in n party settings, tolerating a computationally unbounded semi-honest adversary, who can passively corrupt at most t < n/2 parties. To the best of our knowledge, these ...

متن کامل

Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security

In this paper, we focus on the specific problems of Private Matching, Set Disjointness and Cardinality of Set Intersection in information theoretic settings. Specifically, we give perfectly secure protocols for the above problems in n party settings, tolerating a computationally unbounded semi-honest adversary, who can passively corrupt at most t < n/2 parties. To the best of our knowledge, the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mu?la journal of science and technology

سال: 2022

ISSN: ['2149-3596']

DOI: https://doi.org/10.22531/muglajsci.1075788